On Shift Register Realization of Sequential Circuits II
نویسنده
چکیده
This is the second of a series of intended reports on realization of sequential machines with shift registers and on properties of shift registers. Some of the pathological cases for the shift register realization algorithms SRR/GSRR reported in the previous report are investigated here. One of the pathological cases turned out to be simple cycles, and based on the work of Yoeli, an algorithm has been developed for nding a shift register code for them. Another case is simple cycles with one chord. It is shown that they can be realized with a shift register if their length n is a power of 2, and the cycle determined by their chord is of length n=4 or less, or equal to n=2. Also the realizability of sequential machines with bidirectional shift registers is studied. A necessary and suucient condition has been found for the case when the number of states is a power of 2.
منابع مشابه
On Shift Register Realization of Sequential Circuits
Realizing a sequential machine with shift registers is an attractive approach to the design for testability. It requires little extra circuit for scan and since feed-backs are always to the rst ip-op of a shift register test generation is expected to be easier than that for circuits with unstructured feedbacks. Though the shift register realization of sequential machines was studied by several ...
متن کاملSynthesis and Realization of Linear Feedback Shift Register Using Reversible Logic
Reversible logic is playing an important role in research areas and has found its applications in low power CMOS VLSI, Nanotechnology and Quantum computation. The research on reversibility has shown greater impact to have enormous applications in emerging technologies such as Quantum Computing, QCA, Nanotechnology and Low Power VLSI. Reversible logic is considered as a computing paradigm in whi...
متن کاملClassification of Sequential Circuits Based on Combinational Test Generation Complexity
Several classes of sequential circuits with combinational test generation complexity have been introduced. However, no general notation is used to define the time complexity of test generation. In this paper, we introduce a new test generation notation that we call τ notation in order to present and clarify the classification of sequential circuits based on the combinational test generation com...
متن کاملDesign of Static Flip-Flops for Low-Power Digital Sequential Circuits
In this paper, we correlated various Master and slave flip-flops i.e., single edge triggered flipflops. The low-power flip-flops have place utmost necessary elements all the range of the constructing static or successive circuits. We accomplish the comparison for their performance, Delay, Rise time, Fall Time and Power dissipation. Because Power confide in the number of transistors in the circu...
متن کاملDesign of low power random number generators for quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are a promising nanotechnology to implement digital circuits at the nanoscale. Devices based on QCA have the advantages of faster speed, lower power consumption, and greatly reduced sizes. In this paper, we are presented the circuits, which generate random numbers in QCA. Random numbers have many uses in science, art, statistics, cryptography, gaming, gambli...
متن کامل